Performance Comparison based on Open Shortest Path First (OSPF) Routing Algorithm for IP Internet Networks
نویسندگان
چکیده
منابع مشابه
Multiple path routing algorithm for IP networks
Internet routing protocols, such as Open Shortest Path First (OSPF), compute a shortest path tree from each node to other nodes in the network, using link-state information. Such protocols do not consider the queueing situation at a given node. An alternate path of higher cost may be more convenient to use than the optimum path when a long queue is present at the node. This paper proposes a new...
متن کاملOpen shortest path first routing under random early detection
In this paper we consider a variant of Open Shortest Path First (OSPF) routing that accounts for Random Early Detection (RED), an Active Queue Management method for backbone networks. In the version of OSPF we consider in this paper we only require a single network path be available between each origin and destination, a simplification of the OSPF protocol. We formulate a mixed integer nonlinea...
متن کاملPriority-based Adaptive Shortest Path Routing for IP over LEO Satellite Networks
Designing an efficient routing algorithm for LEO satellite constellations is crucial for optimizing IP over Satellite (IPoS) network resources. Since there could be many shortest paths between two satellites, an efficient routing algorithm should provide better utilization of these paths. For this purpose, we propose a Priority-based Adaptive Routing (PAR) technique, which distributedly sets th...
متن کاملOSPF Weight Tuning for Efficient Routing in IP Networks
Routing within a telecommunication network defines how the traffic flow is mapped on the network topology. The increasing commercial importance of the Internet together with a rising number of real-time applications make of the routing mechanisms as essential feature in the control of the network performance. The routing mechanisms involved allow to assign the network capacities, more or less e...
متن کاملA Multi-path Routing Algorithm for IP Networks Based on Flow Optimisation
Intra-domain routing in the Internet normally uses a single shortest path to forward packets towards a specific destination with no knowledge of traffic demand. We present an intra-domain routing algorithm based on multi-commodity flow optimisation which enable load sensitive forwarding over multiple paths. It is neither constrained by weight-tuning of legacy routing protocols, such as OSPF, no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications on Applied Electronics
سال: 2019
ISSN: 2394-4714
DOI: 10.5120/cae2019652838